Threshold quantum cryptograph based on Grover’s algorithm
نویسندگان
چکیده
Grover’s operator in the two-qubit case can transform a basis into its conjugated basis. A permutation operator can transform a state in the two conjugated bases into its orthogonal state. These properties are included in a threshold quantum protocol. The proposed threshold quantum protocol is secure based the proof that the legitimate participators can only eavesdrop 2 bits of 3 bits operation information on one two-qubit with error probability 3/8. We propose a scheme to detect the Trojan horse attack without destroying the legal qubit.
منابع مشابه
Quantum Secret Sharing with Grover’s Algorithm
Quantum secret sharing addresses the same problem that classical secret sharing does, but via quantum means. That is, Alice wishes to send a secret to n agents, and any k ≤ n agents can collaborate to recover the secret. However, for any fewer than k agents, collaboration will information-theoretically reveal no information about the secret. Such protocols are called (k,n)threshold schemes, and...
متن کاملGlobal Optimization with Quantum Walk Enhanced Grover Search
One of the significant breakthroughs in quantum computation is Grover’s algorithm for unsorted database search. Recently, the applications of Grover’s algorithm to solve global optimization problems have been demonstrated, where unknown optimum solutions are found by iteratively improving the threshold value for the selective phase shift operator in Grover rotation. In this paper, a hybrid appr...
متن کاملA Quantum CAD Accelerator Based on Grover's Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form
1 This work was supported in part by the Advanced Technology Program (ATP) of Texas under grant 003613-0029-2003. Abstract We describe the use of Grover’s algorithm as implemented in a quantum logic circuit that produces a solution for a classical switching circuit design problem. The particular application described here is to determine a Fixed Polarity Reed-Muller (FPRM) form that satisfies a...
متن کاملAn Intuitive Hamiltonian for Quantum Search
We present new intuition behind Grover’s quantum search algorithm by means of a Hamiltonian. Given a black-box Boolean function f : {0, 1}n → {0, 1} such that f(w) = 1 for exactly one w ∈ {0, 1}n, Grover [4] describes a quantum algorithm that finds w in O(2) time. Farhi & Gutmann [3] show that w can also be found in the same amount time by letting the quantum system evolve according to a simple...
متن کاملAn information-theoretic analysis of Grover’s algorithm
Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately π/4 √ N queries to a quantum oracle. For classical search using a classical oracle, the search complexity is of order N/2 queries since on average half of the items must be searched. In work preceding Grover’s, Bennett et al. had shown that no quantum algorithm c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006